The Linguistic Relevance of Quasi-Trees

نویسندگان

  • Anthony Kroch
  • Owen Rambow
چکیده

We discuss two constructions (long scrambling and ECM verbs) which challenge most syntactic theories (including traditional TAG approaches) since they seem to require exceptional mechanisms and postulates. We argue that these constructions should in fact be analyzed in a similar manner, namely as involving a verb which selects for a " defective " complement. These complements are defective in that they lack certain Case-assigning abilities (represented as functional heads). The constructions differ in how many such abilities are lacking. Following the previous analysis of scrambling of Rambow (1994), we propose a TAG analysis based on quasi-trees.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Mapping Syntactic to Semantic Generalizations of Linguistic Parse Trees

We define sentence generalization and generalization diagrams via a special case of least general generalization (LGG) as applied to linguistic parse trees. Similarity measure between linguistic parse trees is developed as LGG operation on the lists of sub-trees of these trees. The diagrams introduced are representation of mapping between the syntactic generalization level and semantic generali...

متن کامل

Linguistic Means of Description of Family Relations in the Novel “In Chancery” By J. Galsworthy

The article is devoted to the study of the evaluative component of the meaning of lexical means used to describe relations between family members in the novel “In Chancery” by J. Galsworthy. The relevance of t &he study can be attributed to the lack of works devoted to this problem. As the results of our study demonstrate, the words of the lexical-semantic group “family” were mainly used to ver...

متن کامل

GOFAISUM: A Symbolic Summarizer for DUC

This article presents GOFAISUM, a topicanswering and summarizing system developed for the main task of DUC 2007 by the Université de Montréal and the Université de Genève. We chose to use an all-symbolic approach, the only source of linguistic knowledge being FIPS, a multilingual syntactic parser. We further attempted to innovate by using XML and XSLT to both represent FIPS’s analysis trees and...

متن کامل

ON QUASI UNIVERSAL COVERS FOR GROUPS ACTING ON TREES WITH INVERSIONS

Abstract. In this paper we show that if G is a group acting on a tree X with inversions and if (T Y ) is a fundamental domain for the action of G on X, then there exist a group &tildeG and a tree &tildeX induced by (T Y ) such that &tildeG acts on &tildeX with inversions, G is isomorphic to &tilde G, and X is isomorphic to &tildeX. The pair (&tilde G &tildeX) is called the quasi universal cover...

متن کامل

A New Algorithm for Optimization of Fuzzy Decision Tree in Data Mining

Decision-tree algorithms provide one of the most popular methodologies for symbolic knowledge acquisition. The resulting knowledge, a symbolic decision tree along with a simple inference mechanism, has been praised for comprehensibility. The most comprehensible decision trees have been designed for perfect symbolic data. Classical crisp decision trees (DT) are widely applied to classification t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/cmp-lg/9411007  شماره 

صفحات  -

تاریخ انتشار 1994